A general lower bound for collaborative tree exploration

We consider collaborative graph exploration with a set of $k$ agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small ($k \leq \sqrt n$) and large ($k \geq n$) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains. First, we significantly extend a lower bound of $\Omega(\log k / \log\log k)$ by Dynia et al. on the competitive ratio of a collaborative tree exploration strategy to the range $k \leq n \log^c n$ for any $c \in \mathbb{N}$. Second, we provide a tight lower bound on the number of agents needed for any competitive exploration algorithm. In particular, we show that any collaborative tree exploration algorithm with $k = Dn^{1+o(1)}$ agents has a competitive ratio of $\omega(1)$, while Dereniowski et al. gave an algorithm with $k = Dn^{1+\varepsilon}$ agents and competitive ratio $O(1)$, for any $\varepsilon > 0$ and with $D$ denoting the diameter of the graph. Lastly, we show that, for any exploration algorithm using $k = n$ agents, there exist trees of arbitrarily large height $D$ that require $\Omega(D^2)$ rounds, and we provide a simple algorithm that matches this bound for all trees

Divergence Measure Between Chaotic Attractors

We propose a measure of divergence of probability distributions for quantifying the dissimilarity of two chaotic attractors. This measure is defined in terms of a generalized entropy. We illustrate our procedure by considering the effect of additive noise in the well known H\'enon attractor. Comparison of two H\'enon attractors for slighly different parameter values, has shown that the divergence has complex scaling structure. Finally, we show how our approach allows to detect non-stationary events in a time series.Comment: 9 pages, 6 figure

Time series irreversibility: a visibility graph approach

We propose a method to measure real-valued time series irreversibility which combines two differ- ent tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally effi- cient, does not require any ad hoc symbolization process, and naturally takes into account multiple scales. We find that the method correctly distinguishes between reversible and irreversible station- ary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible stochastic pro- cesses (a discrete flashing ratchet in an asymmetric potential), (iii) reversible (conservative) and irreversible (dissipative) chaotic maps, and (iv) dissipative chaotic maps in the presence of noise. Two alternative graph functionals, the degree and the degree-degree distributions, can be used as the Kullback-Leibler divergence argument. The former is simpler and more intuitive and can be used as a benchmark, but in the case of an irreversible process with null net current, the degree-degree distribution has to be considered to identifiy the irreversible nature of the series.Comment: submitted for publicatio

Anonymous Graph Exploration with Binoculars

International audienceWe investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after the exploration except if the graph is a tree. We therefore endow the agent with binoculars, a sensing device that can show the local structure of the environment at a constant distance of the agent current location.We show that, with binoculars, it is possible to explore and halt in a large class of non-tree networks. We give a complete characterization of the class of networks that can be explored using binoculars using standard notions of discrete topology. This class is much larger than the class of trees: it contains in particular chordal graphs, plane triangulations and triangulations of the projective plane. Our characterization is constructive, we present an Exploration algorithm that is universal; this algorithm explores any network explorable with binoculars, and never halts in non-explorable networks

Impact of blood storage and sample handling on quality of high dimensional flow cytometric data in multicenter clinical research

Obtaining reliable and reproducible high quality data in multicenter clinical research settings requires design of optimal standard operating procedures. While the need for standardization in sample processing and data analysis is well-recognized, the impact of sample handling in the pre-analytical phase remains underestimated. We evaluated the impact of sample storage time (approximate to transport time) and temperature, type of anticoagulant, and limited blood volume on reproducibility of flow cytometric studies. EDTA and Na-Heparin samples processed with the EuroFlow bulk lysis protocol, stained and stored at 4 degrees C showed fairly stable expression of cell surface markers and distribution of the major leukocyte populations for up to 72 h. Additional sample fixation (1% PFA, Fix & Perm) did not have any beneficial effects. Blood samples stored for < 24 h at room temperature before processing and staining seemed suitable for reliable immunophenotyping, although losses in absolute cell numbers were observed. The major losses were observed in myeloid cells and monocytes, while lymphocytes seemed less affected. Expression of cell surface markers and population distribution were more stable in Na-Heparin blood than in EDTA blood. However, storage of Na-Heparin samples was associated with faster decrease in leukocyte counts over time. Whole blood fixation strategies (Cyto-Chex, TransFix) improved long-term population distribution, but were detrimental for expression of cellular markers. The main conclusions from this study on healthy donor blood samples were successfully confirmed in EDTA clinical (patient) blood samples with different time delays until processing. Finally, we recognized the need for adjustments in bulk lysis in case of insufficient blood volumes. Despite clear overall conclusions, individual markers and cell populations had different preferred conditions. Therefore, specific guidelines for sample handling should always be adjusted to the clinical application and the main target leukocyte population